EXPECTED MEAN WIDTH OF THE RANDOMIZED INTEGER CONVEX HULL
نویسندگان
چکیده
Let K ⊂ R d be a convex body, and assume that L is randomly rotated shifted integer lattice. the hull of (random) points ∩ . The mean width W ( ) investigated. asymptotic order difference λ − maximized by obtained polytopes minimized for smooth sets as → ∞
منابع مشابه
The Randomized Integer Convex Hull
Let K ⊂ R d be a sufficiently round convex body (the ratio of the circumscribed ball to the inscribed ball is bounded by a constant) of a sufficiently large volume. We investigate the randomized integer convex hull I L (K) = conv(K ∩L), where L is a randomly translated and rotated copy of the integer lattice Z d. We estimate the expected number of vertices of I L (K), whose behaviour is similar...
متن کاملOn the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull
We investigate several computational problems related to stochastic convex hull (SCH). Given a stochastic dataset consisting of n points in R each of which has an existence probability, a SCH refers to the convex hull of a realization of the dataset, i.e., a random sample including each point with its existence probability. We are interested in the computation of some expected statistics of a S...
متن کاملThe Mean Width of a Convex Polytope
In the case n=d = 2, because of Cauchy's surface-area formula [2; p. 208], relation (3) reduces to the trivial statement that the perimeter of a convex polygon is equal to the sum of the lengths of its edges. If K is any closed bounded convex set of dimension at most d, we may write KaEczE and use md(K) and mn(K) to denote the mean widths of K relative to the spaces E and E respectively. A simp...
متن کاملThe Integer Hull of a Convex Rational Polytope
Given A ∈ Zm×n and b ∈ Z, we consider the integer program max{c′x|Ax = b;x ∈ N} and provide an equivalent and explicit linear program max{ĉ′q|Mq = r; q ≥ 0}, where M, r, ĉ are easily obtained from A, b, c with no calculation. We also provide an explicit algebraic characterization of the integer hull of the convex polytope P = {x ∈ R|Ax = b;x ≥ 0}. All strong valid inequalities can be obtained f...
متن کاملConvex hull approximation of TU integer recourse models
We consider a convex approximation for integer recourse models. In particular, we show that the claim of Van der Vlerk [83] that this approximation yields the convex hull of totally unimodular (TU) integer recourse models is incorrect. We discuss counterexamples, indicate which step of its proof does not hold in general, and identify a class of random variables for which the claim in Van der Vl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2021
ISSN: ['2041-7942', '0025-5793']
DOI: https://doi.org/10.1112/mtk.12080